The Traffic Equilibrium Problem with Nonadditive Path Costs

The Traffic Equilibrium Problem with Nonadditive Path Costs

In this paper we present a version of the (static) traac equilibrium problem in which the cost incurred on each path is not simply the sum of the costs on the arcs that constitute that path. We motivate this nonadditive version of the problem by describing several situations in which the classic additivity assumption fails. We describe existence and uniqueness conditions for this problem and we...

The Tra c Equilibrium Problem with Nonadditive Path CostsSteven

In this paper we present a version of the (static) traac equilibrium problem in which the cost incurred on a path is not simply the sum of the costs on the arcs that constitute that path. We motivate this nonadditive version of the problem by describing several situations in which the classical additiv-ity assumption fails. We also present an algorithm for solving nonadditive problems that is b...

Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs

Solving the Nonadditive Traac Equilibrium Problem

In this paper we develop an algorithm for solving a version of the (static) traac equilibrium problem in which the cost incurred on each path is not simply the sum of the costs on the arcs that constitute that path. The method we describe is based on the recent NE/SQP algorithm , a fast and robust technique for solving nonlinear complementarity problems. Finally, we present an example that illu...

A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem

Gradient projection (GP) algorithm has been shown as an efficient algorithm for solving the traditional traffic equilibrium problem with additive route costs. Recently, GP has been extended to solve the nonadditive traffic equilibrium problem (NaTEP), in which the cost incurred on each route is not just a simple sum of the link costs on that route. However, choosing an appropriate stepsize, whi...